Optical in-band crosstalk monitor placement using Partial Set Cover model
نویسندگان
چکیده
منابع مشابه
Power Quality Monitor Placement Using a Tri-level Approach
Finding minimum number of connecting lines is as important as locating power quality monitors (PQMs) for full observability of power system. Therefore, a PQM placement method should determine both optimum buses and lines, since utilities can make better decisions for monitoring of power system with this information. This paper attempted to propose a new method to locate the PQMs at various unob...
متن کاملResilience of All - Optical Network Architectures under In - Band Crosstalk Attacks : A Graphical Model Approach 1
networks (AONs) is how to incorporate security against attacks in the design and engineering of network architectures. In this work, we study the resilience of AON architectures under in-band crosstalk attacks. Crosstalk attack propagation depends on both optical devices at the physical layer and wavelength usage at the network layer. This motivates us to apply probabilistic graphical models to...
متن کاملFractional Set Cover in the Streaming Model
We study the Fractional Set Cover problem in the streaming model. That is, we consider the relaxation of the set cover problem over a universe of n elements and a collection of m sets, where each set can be picked fractionally, with a value in [0, 1]. We present a randomized (1 + ε)approximation algorithm that makes p passes over the data, and uses Õ(mnO(1/pε) +n) memory space. The algorithm wo...
متن کاملSet Cover 1 Unweighted Set Cover
Let X = {x1, ..., xn} be a set, and let P = {P1, ..., Pm} be a set of subsets of X. The goal is to find the smallest sub-collection of sets R ⊆ P whose union covers all of X. More concretely, we can say that each xi, 1 ≤ i ≤ n represents a “skill”, and each Pj, 1 ≤ j ≤ m represents a “person”. In this case, xi ∈ Pj if person Pj has the skill xi. Then, as an employer, the goal is to find the min...
متن کاملPartial Interval Set Cover - Trade-Offs between Scalability and Optimality
Given an interval I = {1, 2, ..., n} of points, a collection I of subintervals of I and a fraction 0 ≤ r ≤ 1, we consider the following variation of partial set cover. We wish to find an optimal subset of I covering at least an r-fraction of I. While this problem is easily solved exactly in quadratic time using classical methods, we focus on developing scalable algorithms which return near-opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2012
ISSN: 2187-0136
DOI: 10.1587/comex.1.78